Huff-type competitive facility location model with foresight in a discrete space

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Competitive Facility Location Problem in a Discrete Planar Space

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...

متن کامل

Discrete models for competitive location with foresight

We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective is to locate facilities under a budget constraint in order to maximise the remaining market share after the competitor’s later entry. We develop mixed zero-one programming formulations for each of the following three s...

متن کامل

Sequential Competitive Facility Location Problem in a Discrete Planar Space

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens p new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candidate...

متن کامل

p-facility Huff location problem on networks

The p-facility Hu location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the eld of continuous location, in this paper we study the p-facility Hu location problem on networks formulated as a Mixed Integer Nonlinear Programming problem that can be solved by a branch and bound algorithm. We propose two appr...

متن کامل

Discrete facility location with nonlinear facility costs

— We treat a discrete uncapacitated facility location problem where the installation cost per facility is a gênerai nonlinear function of the number of established facilities. Assuming a convexity proper ty, Mirchandani and Jagannathan developed a heur is tic solution procedure for this problem. Hère, we show how to modify their algorithm in order to get and prove exact solutions and, at the sa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Management Science Letters

سال: 2011

ISSN: 1923-9335,1923-9343

DOI: 10.5267/j.msl.2010.01.0010